Vertex Cover: Further Observations and Further Improvements
نویسندگان
چکیده
Recently, there has been increasing interest and progress in lowering the worstcase time complexity for well-known NP-hard problems, particularly for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated, and several simple and new techniques are introduced, which lead to an improved algorithm of time O kn + 1 2852 for the problem. Our algorithm also induces improvement on previous algorithms for the Independent Set problem on graphs of small degree. 2001 Elsevier Science
منابع مشابه
On Approximation Hardness of the Minimum 2SAT-DELETION Problem
The Minimum 2SAT-Deletion problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems [8], and its approximability is largely open. We prove a lower approximation bound of 8 √ 5 − 15 ≈ 2.88854, improving the previous bound of 10 √ 5 − 21 ≈ 1.36067 by Dinur and Safra [5]. For h...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملFurther Observations on Blocking Zeros in Linear Muitivariabie systems (RESEARCH NOTE).
While attempting to clarify the confusion concerning the conceptualization of "blocking zeros" in state space in the recent literature, some new observations are made on the relationship between pole-zero cancellation and transmission blocking. An important distinction between uncontrollable and unobservable eigenvalue s is pointed out; and it is argued that the description of a Blocking Zero, ...
متن کاملDistributed Vertex Cover in Network Graphs
Vertex cover, a minimal set of nodes to cover all edges in a graph, is an abstraction of coverage problems in sensor networks, transportation networks, etc, and is a well-konwn NP-hard problem. Minimum weighted vertex cover (MWVC) problem asks for further minimizing the cumulative weight of a vertex cover. We present new distributed k-hop algorithms for MWVC problem with theoretical and practic...
متن کاملA polynomial time 3-2-approximation algorithm for the vertex cover problem on a class of graphs
We develop a polynomial time 3-2-approximation algorithm to solve the vertex cover problem on a class of graphs satisfying a property called “active edge hypothesis”. The algorithm also guarantees an optimal solution on specially structured graphs. Further, we give an extended algorithm which guarantees a vertex cover S1 on an arbitrary graph such that |S1| ≤ 32 |S*| + ξ where S* is an optimal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 41 شماره
صفحات -
تاریخ انتشار 1999